2 research outputs found
Stochastic Unsplittable Flows
We consider the stochastic unsplittable flow problem: given a graph with edge-capacities, and source-sink pairs with each pair having a size and a value, the goal is to route the pairs unsplittably while respecting edge capacities to maximize the total value of the routed pairs. However, the size of each pair is a random variable and is revealed only after we decide to route that pair. Which pairs should we route, along which paths, and in what order so as to maximize the expected value?
We present results for several cases of the problem under the no-bottleneck assumption. We show a logarithmic approximation algorithm for the single-sink problem on general graphs, considerably improving on the prior results of Chawla and Roughgarden which worked for planar graphs. We present an approximation to the stochastic unsplittable flow problem on directed acyclic graphs, within less than a logarithmic factor of the best known approximation in the non-stochastic setting. We present a non-adaptive strategy on trees that is within a constant factor of the best adaptive strategy, asymptotically matching the best results for the non-stochastic unsplittable flow problem on trees. Finally, we give results for the stochastic unsplittable flow problem on general graphs.
Our techniques include using edge-confluent flows for the single-sink problem in order to control the interaction between flow-paths, and a reduction from general scheduling policies to "safe" ones (i.e., those guaranteeing no capacity violations), which may be of broader interest
Improved lower bounds for Queen's Domination via an exactly-solvable relaxation
The Queen's Domination problem, studied for over 160 years, poses the
following question: What is the least number of queens that can be arranged on
a chessboard so that they either attack or occupy every cell?
We propose a novel relaxation of the Queen's Domination problem and show that
it is exactly solvable on both square and rectangular chessboards. As a
consequence, we improve on the best known lower bound for rectangular
chessboards in of the non-trivial cases. As another
consequence, we simplify and generalize the proofs for the best known
lower-bounds for Queen's Domination of square chessboards for using an elegant idea based on a convex hull.
Finally, we show some results and make some conjectures towards the goal of
simplifying the long complicated proof for the best known lower-bound for
square boards when (and ). These simple-to-state
conjectures may also be of independent interest.Comment: 20 pages, 7 figures For associated repo, see
https://github.com/architkarandikar/queens-dominatio